On Symmetrized Weight Compositions

نویسنده

  • Ali Assem
چکیده

A characterization of module alphabets with the Hamming weight EP (abbreviation for Extension Property) had been settled. A thoughtfully constructed piece-of-art example by J.A.Wood ([7]) finished the tour. In 2009, in [8], Frobenius bimodules were proved to satisfy the EP with respect to symmetrized weight compositions. In [4], the embeddability in the character group of the ambient ring R was found sufficient for a module RA to satisfy the EP with respect to swc built on any subgroup of AutR(A), while the necessity remained a question. Here, landing in a “Midway”, the necessity is proved by jumping to Hamming weight. Corollary 1.11 declares a characterization of module alphabets satisfying the EP with respect to swc. Note: All rings are finite with unity, and all modules are finite too. This may be re-emphasized in some statements. The convention for functions is that inputs are to the left. Symmetrized Weight Compositions Definition 1.1. (Symmetrized Weight Compositions) Let G be a subgroup of the automorphism group of a finite R-module A. Define ∼ on A by a ∼ b if a = bτ for some τ ∈ G. Let A/G denote the orbit space of this action. The symmetrized weight composition is a function swc : A ×A/G → Q defined by, swc(x, a) = swca(x) = |{i : xi ∼ a}|, where x = (x1, . . . , xn) ∈ A and a ∈ A/G. Definition 1.2. Let G be a subgroup of AutR(A), a map T ia called a G-monomial transformation of A if for any (x1, . . . , xn) ∈ A (x1, . . . , xn)T = (xσ(1)τ1, . . . , xσ(n)τn), where σ ∈ Sn and τi ∈ G for i = 1, . . . , n. Definition 1.3. (Extension Property) The alphabet A has the extension property with respect to swc if for every n, and any two linear codes C1, C2 ⊂ A, any R-linear isomorphism f : C1 → C2 that preserves swc is extendable to a G-monomial transformation of A.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Extension Theorem with Respect to Symmetrized Weight Compositions

We will say that an alphabet A satisfies the extension property with respect to a weight w if every linear isomorphism between two linear codes in A that preserves w extends to a monomial transformation of A. In the 1960s MacWilliams proved that finite fields have the extension property with respect to Hamming weight. It is known that a module A has the extension property with respect to Hammin...

متن کامل

Weight Functions and theExtension Theorem for Linear

An extension theorem for general weight functions is proved over nite chain rings. The structure of the complex semigroup ring associated to the multiplicative semigroup of the ring plays a prominent role in the proof. 1. Background In her doctoral dissertation, MacWilliams 7], 8] proved an equivalence theorem: two linear codes C 1 ; C 2 F n deened over a nite eld F are equivalent up to monomia...

متن کامل

Extension Theorems for Linear Codes over Finite Rings

Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is proved. As a consequence, an extension theorem for weight functions over certain nite commutative rings is also proved. The proofs make use of the linear independence of characters as well as the linear independence ...

متن کامل

Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes

The paper describes a method to determine symmetrized weight enumerators of Zpm -linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24 modulo 2 and modulo 3 , for any positive m .

متن کامل

A criterion for designs in Z 4 - codes on the symmetrized weight enumerator

The Assmus{Mattson theorem is a method to nd designs in linear codes over a nite eld. It is an interesting problem to nd an analogue of the theorem for Z 4 -codes. The author once gave a candidate of the theorem. The purpose of this paper is an improvement of the theorem. It is known that the lifted Golay code over Z 4 contains 5-designs on Lee compositions. The improved method can nd some of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1412.6083  شماره 

صفحات  -

تاریخ انتشار 2014